Chaotic Root-Finding for a Small Class of Polynomials
نویسنده
چکیده
In this paper we present a new closed-form solution to a chaotic difference equation, yn+1 = a2y 2 n + a1yn + a0 with coefficient a0 = (a1 − 4)(a1 + 2)/(4a2), and using this solution, show how corresponding exact roots to a special set of related polynomials of order 2, p ∈ N with two independent parameters can be generated, for any p.
منابع مشابه
Chaotic Root-Finding for a Small Class of Polynomials
In this paper we present a new closed-form solution to a chaotic difference equation, yn+1 = a2y 2 n + a1yn + a0 with coefficient a0 = (a1 − 4)(a1 + 2)/(4a2), and using this solution, show how corresponding exact roots to a special set of related polynomials of order 2, p ∈ N with two independent parameters can be generated, for any p.
متن کاملA numerical technique for solving a class of 2D variational problems using Legendre spectral method
An effective numerical method based on Legendre polynomials is proposed for the solution of a class of variational problems with suitable boundary conditions. The Ritz spectral method is used for finding the approximate solution of the problem. By utilizing the Ritz method, the given nonlinear variational problem reduces to the problem of solving a system of algebraic equations. The advantage o...
متن کاملObserver Based Fuzzy Terminal Sliding Mode Controller Design for a Class of Fractional Order Chaotic Nonlinear Systems
This paper presents a new observer based fuzzy terminal sliding mode controller design for a class of fractional order nonlinear systems. Robustness against uncertainty and disturbance, the stability of the close loop system and the convergence of both the tracking and observer errors to zero are the merits of the proposed the observer and the controller. The high gain observer is applied to es...
متن کاملFinding Small Solutions of a Class of Simultaneous Modular Equations and Applications to Modular Inversion Hidden Number Problem and Inversive Congruential Generator
In this paper we revisit the modular inversion hidden number problem and the inversive congruential pseudo random number generator and consider how to more efficiently attack them in terms of fewer samples or outputs. We reduce the attacking problem to finding small solutions of systems of modular polynomial equations of the form ai+bix0+cixi+x0xi = 0 (mod p), and present two strategies to cons...
متن کاملEstimating Jones and Homfly polynomials with one clean qubit
The Jones and HOMFLY polynomials are link invariants with close connections to quantum computing. It was recently shown that finding a certain approximation to the Jones polynomial of the trace closure of a braid at the fifth root of unity is a complete problem for the one clean qubit complexity class[18]. This is the class of problems solvable in polynomial time on a quantum computer acting on...
متن کامل